On radio Heronian Dd-distance mean of some standard graphs
نویسندگان
چکیده
A Radio Heronian Mean Dd-distance Labeling of a connected graph is an injective map from the vertex set N such that for two distinct vertices and , Dd where denotes between Dd-diameter G.
منابع مشابه
On Radio Mean Number of Some Graphs
A radio mean labeling of a connected graph G is a one to one map f from the vertex set V (G) to the set of natural numbers N such that for each distinct vertices u and v of G, d (u, v)+ ⌈ f(u)+f(v) 2 ⌉ ≥ 1+ diam (G). The radio mean number of f , rmn (f), is the maximum number assigned to any vertex of G.The radio mean number of G, rmn (G) is the minimum value of rmn (f) taken over all radio mea...
متن کاملFurther results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملDistance-Balanced Closure of Some Graphs
In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.
متن کاملDistance mean-regular graphs
We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. A graph Γ = (V,E) with diameter D is distance meanregular when, for given u ∈ V , the averages of the intersection numbers ai(u, v), bi(u, v), and ci(u, v) (defined as usual), computed over all vertices v at distance i = 0, 1, . . . , D from u, do...
متن کاملRadio labelings of distance graphs
for any two distinct vertices x and y, where d(x, y) is the distance between x and y in G. The radio k-labeling number rlk(G) of G is the minimum of maxx,y∈V (G) |f(x)− f(y)| over all radio k-labelings f of G. The study of radio k-labelings was initiated by Chartrand et al. [1], motivated by radio channel assignment problems with interference constraints. Except for paths [1, 3] and cycles [5],...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Health Sciences (IJHS)
سال: 2022
ISSN: ['2550-6978', '2550-696X']
DOI: https://doi.org/10.53730/ijhs.v6ns3.6267